Hybrid ARQ with Random Thansmission Assignments
نویسندگان
چکیده
In mobile packet data and voice networks, a special coding scheme, known as the incremental redundancy hybrid ARQ (IR HARQ), achieves higher throughput efficiency than ordinary turbo codes by adapting its error correcting code redundancy to fluctuating channel conditions characteristic for this application. An IR HARQ protocol operates as follows. Initially, the information bits are encoded by a “mother” code and a selected number of parity bits are transmitted. If a retransmission is requested, only additional selected parity bits are transmitted. At the receiving end, the additional parity bits are combined with the previously received bits, allowing for an increase in the error correction capacity. This procedure is repeated after each subsequent retransmission request until the entire codeword of the mother code is transmitted. A number of important issues such as error rate performance after each transmission on time varying channels, and rate and power control are difficult to analyze in a network employing a particular HARQ scheme, i.e., a given mother code and given selection of bits for each transmission. By relaxing only the latter constraint, namely, by allowing random selection of the bits for each transmission, we provide very good estimates of error rates allowing us to address to a certain extent the rate and power control problem.
منابع مشابه
Incremental Redundancy Hybrid ARQ with LDPC and Raptor Codes
Two incremental redundancy hybrid ARQ (IR-HARQ) schemes are proposed, analyzed, and compared: one is based on LDPC code ensembles with random transmission assignments, the other is based on recently introduced Raptor codes. A number of important issues, such as rate and power control, Raptor code design, and error rate performance after each transmission on time varying binary-input, symmetrico...
متن کاملPerformance analysis of Incremental Redundancy Hybrid ARQ Schemes with Parallel Concatenated LDPC codes*
The character of Parallel Concatenated LDPC codes with rate-compatible is analyzed. An Incremental redundancy hybrid ARQ scheme based on parallel concatenated LDPC codes is introduced. We studied the throughput of the new HARQ scheme and obtained the closed_form solutions. Furthermore, the throughput of the new HARQ scheme is simulated. It shows that for arbitrary block fading channel, comprisi...
متن کاملImproved regular and semi-random rate-compatible low-density parity-check codes with short block lengths
Powerful rate-compatible codes are essential for achieving high throughput in hybrid automatic repeat request (ARQ) systems for networks utilising packet data transmission. The paper focuses on the construction of efficient rate-compatible low-density parity-check (RC-LDPC) codes over a wide range of rates. Two LDPC code families are considered; namely, regular LDPC codes which are known for go...
متن کاملA Random Network Coding-based ARQ Scheme and Performance Analysis for Wireless Broadcast
A wireless broadcast retransmission scheme based on the random network coding is put forward for the reliable broadcast in wireless broadcast system. With the strategy to allow the sender to combine and retransmit lost packets by using the random linear codes, the scheme can effectively reduce the number of retransmissions and improve the throughput efficiency. Based on the burst error channel ...
متن کاملPerformance of truncated type-II hybrid ARQ schemes with noisy feedback over block fading channels
This paper considers truncated type-II hybrid automatic repeat-request (ARQ) schemes with noisy feedback over block fading channels. With these ARQ techniques, the number of retransmissions is limited, and, similar to forward error correction (FEC), error-free delivery of data packets cannot be guaranteed. Bounds on the average number of transmissions, the average coding rate as well as the rel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003